A Brute Force Approach to Solving the Knights Tour Problem Using Prolog
نویسنده
چکیده
The knight’s tour problem is an old problem. It was investigated by Euler as well as a number of other researchers in recent years. This work describes the author’s history with the problem, reviews the current work and the implementation. The work describes the algorithm, a depth first search with no bias or heuristic, and provides a discussion along with future work of this work. The work uses the Prolog language to develop a brute force algorithm in finding open circuit solutions to the knight’s tour problem. The program is tested on various prolog implementations. An improved verify/2 predicate is discussed as it improved the overall execution in finding solutions. Future work may investigate the Warnsdorf’s algorithm and magic squares.
منابع مشابه
INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملBalanced Black and White Coloring Problem on knights chessboards
Graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem, i.e., if two vertices are adjacent, their assigned colors must be the same or at least one of them is uncolored. In the same way, Berge in 1972 proposed the problem of placing b black queens and w white queens on a n× n chessboard such that no two queens of different...
متن کاملFailsafe - A Floor Planner that Uses EBG to Learn from Its Failures
Analysis of failed problem solving efforts enables people to guide subsequent problem solving to avoid similar failures. This kind of learning while doing is essential in complex domains. We define Explanation-based Learning from Failure (ELF), a technique for achieving such a capability, and describe its prototype implementation in Failsafe, a Prolog program that learns from failure while solv...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملA Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm
For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...
متن کامل